Improved HLLL Lattice Basis Reduction Algorithm to Solve GNSS Integer Ambiguity
نویسندگان
چکیده
Recently, lattice theory has been widely used for integer ambiguity resolution in the Global Navigation Satellite System (GNSS). When using to deal with ambiguity, we need reduce correlation between bases ensure efficiency of solution. Lattice reduction is divided into scale and basis vector exchange. The no direct impact on subsequent search efficiency, while exchange directly impacts efficiency. Hence, Lenstra-Lenstra-Lovász (LLL) applied improve And based Householder transformation, HLLL improved method also used. Moreover, calculation speed further, a Pivoting LLL (PHLLL) orthogonal transformation rotation sorting proposed here. idea PHLLL as follows: First, sort matrix introduced process original matrix. Then, sorted transformation. After it needs be again, until diagonal elements meet ascending order. In addition, when image operator orthogonalization, old column norm modified obtain new norm, reducing number calculations. Compared algorithm algorithm, experimental results show that higher effectiveness. theoretical superiority proved.
منابع مشابه
Faster Algorithms for Integer Lattice Basis Reduction
The well known L 3-reduction algorithm of Lovv asz transforms a given integer lattice basis b1; b2
متن کاملProbabilistic properties of GNSS integer ambiguity estimation
Successful integer estimation of carrier phase ambiguities of Global Navigation Satellite Systems (GNSS) is the key to many high precision positioning applications. In order to describe the quality of the positioning results rigorously, one needs to know the probabilistic properties of both the integer and noninteger parameters in the GNSS model. In this contribution these probability distribut...
متن کاملA Lattice Basis Reduction Algorithm ∗
In this paper, we give a definition of an optimally reduced basis for a lattice in the sense that an optimally reduced basis is a shortest basis for the lattice. Then we present an algorithm for computing an approximation of an optimally reduced basis for a lattice using a novel unimodular transformation. To compare lattice bases, we propose a quantitative measure of the degree of the linear in...
متن کاملAn Introduction to Lenstra-Lenstra-Lovasz Lattice Basis Reduction Algorithm
Lenstra-Lenstra-Lovasz (LLL) Algorithm is an approximation algorithm of the shortest vector problem, which runs in polynomial time and finds an approximation within an exponential factor of the correct answer. It is a practical method with enough accuracy in solving integer linear programming, factorizing polynomials over integers and breaking cryptosystems. In this paper, we introduce its back...
متن کاملIntegrity monitoring-based ratio test for GNSS integer ambiguity validation
The combination of multiple global navigation satellite systems (GNSSs) is able to improve the accuracy and reliability, which is beneficial for navigation in safety– critical applications. Due to the relatively low accuracy of pseudorange observations, the single-epoch GNSS realtime kinematic (RTK) using phase observations can be utilized to achieve centimeter accuracy positioning instantaneou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Aerospace Engineering
سال: 2023
ISSN: ['1687-5966', '1687-5974']
DOI: https://doi.org/10.1155/2023/5978373